The diophantine equation x3 3 + y3 + z 3 − 2xyz = 0

نویسنده

  • Joseph Amal Nathan
چکیده

We will be presenting two theorems in this paper. The first theorem, which is a new result, is about the non-existence of integer solutions of the cubic diophantine equation. In the proof of this theorem we have used some known results from theory of binary cubic forms and the method of infinite descent, which are well understood in the purview of Elementary Number Theory(ENT). In the second theorem, we show, that the famous Fermat’s Last Theorem(FLT) for exponent 3 and the first theorem are equivalent. So Theorem1 and 2 constitute an alternate proof for the non-existence of integer solutions of this famous cubic Fermat’s equation. It is well known, that from L.Euler(1770) to F.J.Duarte(1944) many had given proof of FLT for exponent 3. But all proofs uses concepts, which are beyond the scope of ENT. Hence unlike other proofs the proof given here is as an ENT proof of FLT for exponent 3. We will denote the greatest common divisor of integers a1, a2, a3, ... by symbol (a1, a2, a3, ...). For the results from theory of Binary Cubic Forms, we follow L.J.Mordell[1]. Consider the binary cubic f(x, y) = ax + bxy + cxy + dy = {a, b, c, d}, with integer coefficients and discriminant D = −27ad + 18abcd + bc − 4ac − 4bd, where D 6= 0. The quadratic covariant H(x, y) is H(x, y) = (b − 3ac)x + (bc− 9ad)xy + (c − 3bd)y, = Ax +Bxy + Cy = {A,B,C} (1) with discriminant B2 − 4AC = −3D and the cubic covariant G(x, y) = −(27ad− 9abc+ 2b)x + 3(6ac + bc− 9abd)xy + 3(bc − 6bd+ 9acd)xy + (27ad − 9bcd+ 2c)y. Lemma1: f(x, y),H(x, y) and G(x, y) are algebraically related by the identity, G(x, y) + 27Df(x, y) = 4H(x, y) [1]. Lemma2: All integer solutions of X + 27kY 2 = 4Z, (X,Z) = 1 (2) are given by taking, X = G(x, y), k = D, Y = f(x, y), Z = H(x, y).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On searching for solutions of the Diophantine equation x3 + y3 +2z3 = n

We propose an efficient search algorithm to solve the equation x3 + y3 + 2z3 = n for a fixed value of n > 0. By parametrizing |z|, this algorithm obtains |x| and |y| (if they exist) by solving a quadratic equation derived from divisors of 2|z|3±n. Thanks to the use of several efficient numbertheoretic sieves, the new algorithm is much faster on average than previous straightforward algorithms. ...

متن کامل

On Searching for Solutions of the Diophantine Equation

We propose a new search algorithm to solve the equation x3+y3 + z3 = n for a fixed value of n > 0. By parametrizing |x| =min(|x|, |y|, |z|), this algorithm obtains |y| and |z| (if they exist) by solving a quadratic equation derived from divisors of |x|3 ± n. By using several efficient number-theoretic sieves, the new algorithm is much faster on average than previous straightforward algorithms. ...

متن کامل

Heegner points and Sylvester’s conjecture

We consider the classical Diophantine problem of writing positive integers n as the sum of two rational cubes, i.e. n = x3 + y3 for x, y ∈ Q. A conjecture attributed to Sylvester asserts that a rational prime p > 3 can be so expressed if p ≡ 4, 7, 8 (mod 9). The theory of mock Heegner points gives a method for exhibiting such a pair (x, y) in certain cases. In this article, we give an expositor...

متن کامل

Selmer’s Example

There is obviously a nonzero solution in R. To show there is a solution besides (0, 0, 0) in each Qp we follow a method I learned from Kevin Buzzard. The basic idea is to show there is a nonzero solution modulo p and then lift that solution p-adically by Hensel’s lemma. We will separately treat the cases p = 3, p = 5, and p 6= 3 or 5. To find a 3-adic solution, set x = 0 and z = −1, making the ...

متن کامل

The Class of Series – Parallel Graphs. Part I

We adopt the following rules: n is a natural number and x1, x2, x3, x4, x5, y1, y2, y3 are sets. Let x1, x2, x3, x4, x5 be sets. We say that x1, x2, x3, x4, x5 are mutually different if and only if: (Def. 1) x1 6= x2 and x1 6= x3 and x1 6= x4 and x1 6= x5 and x2 6= x3 and x2 6= x4 and x2 6= x5 and x3 6= x4 and x3 6= x5 and x4 6= x5. Next we state several propositions: (1) If x1, x2, x3, x4, x5 ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003